A power penalty method for a bounded nonlinear complementarity problem

We propose a novel power penalty approach to the bounded nonlinear complementarity problem (NCP) in which a reformulated NCP is approximated by a nonlinear equation containing a power penalty term. We show that the solution to the nonlinear equation converges to that of the bounded NCP at an exponential rate when the function is continuous and ξ-monotone. A higher convergence rate is also obtained when the function becomes Lipschitz continuous and strongly monotone. Numerical results on discretized ‘double obstacle’ problems are presented to confirm the theoretical results

Hybrid Newton-type method for a class of semismooth equations

In this paper, we present a hybrid method for the solution of a class of composite semismooth equations encountered frequently in applications. The method is obtained by combining a generalized finite-difference Newton method to an inexpensive direct search method. We prove that, under standard assumptions, the method is globally convergent with a local rate of convergence which is superlinear or quadratic. We report also several numerical results obtained applying the method to suitable reformulations of well-known nonlinear complementarity problem

Establishing Nash equilibrium of the manufacturer-supplier game in supply chain management

We study a game model of multi-leader and one-follower in supply chain optimization where n suppliers compete to provide a single product for a manufacturer. We regard the selling price of each supplier as a pre-determined parameter and consider the case that suppliers compete on the basis of delivery frequency to the manufacturer. Each supplier’s profit depends not only on its own delivery frequency, but also on other suppliers’ frequencies through their impact on manufacturer’s purchase allocation to the suppliers. We first solve the follower’s (manufacturer’s) purchase allocation problem by deducing an explicit formula of its solution. We then formulate the n leaders’ (suppliers’) game as a generalized Nash game with shared constraints, which is theoretically difficult, but in our case could be solved numerically by converting to a regular variational inequality problem. For the special case that the selling prices of all suppliers are identical, we provide a sufficient and necessary condition for the existence and uniqueness of the Nash equilibrium. An explicit formula of the Nash equilibrium is obtained and its local uniqueness property is proved

A Globally and Quadratically Convergent Algorithm for Solving Multilinear Systems with M-tensors

We consider multilinear systems of equations whose coefficient tensors are (Formula presented.)-tensors. Multilinear systems of equations have many applications in engineering and scientific computing, such as data mining and numerical partial differential equations. In this paper, we show that solving multilinear systems with (Formula presented.)-tensors is equivalent to solving nonlinear systems of equations where the involving functions are P-functions. Based on this result, we propose a Newton-type method to solve multilinear systems with (Formula presented.)-tensors. For a multilinear system with a nonsingular (Formula presented.)-tensor and a positive right side vector, we prove that the sequence generated by the proposed method converges to the unique solution of the multilinear system and the convergence rate is quadratic. Numerical results are reported to show that the proposed method is promising

Solving variational inequalities defined on a domain with infinitely many linear constraints

We study a variational inequality problem whose domain is defined by infinitely many linear inequalities. A discretization method and an analytic center based inexact cutting plane method are proposed. Under proper assumptions, the convergence results for both methods are given. We also provide numerical examples to illustrate the proposed method